A Geometric Framework for Non-Unitary Joint Diagonalization of Complex Symmetric Matrices

نویسندگان

  • Martin Kleinsteuber
  • Hao Shen
چکیده

Non-unitary joint diagonalization of complex symmetric matrices is an important technique in signal processing. The so-called complex oblique projective (COP) manifold has been shown to be an appropriate manifold setting for analyzing the problem and developing geometric algorithms for minimizing the off-norm cost function. However, the recent identification of the COP manifold as a collection of rank-one orthogonal projector matrices is not a suitable framework for the reconstruction error function due to its large memory requirement compared to the actual dimension of the search space. In this work, we investigate the geometry of the COP manifold as a quotient manifold, which allows less memory requirement, and develop a conjugate gradient algorithm to minimize the reconstruction error function.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Joint Diagonalization and Geometric Mean of Symmetric Positive Definite Matrices

We explore the connection between two problems that have arisen independently in the signal processing and related fields: the estimation of the geometric mean of a set of symmetric positive definite (SPD) matrices and their approximate joint diagonalization (AJD). Today there is a considerable interest in estimating the geometric mean of a SPD matrix set in the manifold of SPD matrices endowed...

متن کامل

A Block-Jacobi Algorithm for Non-Symmetric Joint Diagonalization of Matrices

This paper studies the problem of Non-symmetric Joint Diagonalization (NsJD) of matrices, namely, jointly diagonalizing a set of complex matrices by one matrix multiplication from the left and one multiplication with possibly another matrix from the right. In order to avoid ambiguities in the solutions, these two matrices are restricted to lie in the complex oblique manifold. We derive a necess...

متن کامل

Non-orthogonal tensor diagonalization

Tensor diagonalization means transforming a given tensor to an exactly or nearly diagonal form through multiplying the tensor by non-orthogonal invertible matrices along selected dimensions of the tensor. It has a link to an approximate joint diagonalization (AJD) of a set of matrices. In this paper, we derive (1) a new algorithm for a symmetric AJD, which is called two-sided symmetric diagonal...

متن کامل

Numerical Methods for Simultaneousdiagonalization

We present a Jacobi-like algorithm for simultaneous diagonalization of commuting pairs of complex normal matrices by unitary similarity transformations. The algorithm uses a sequence of similarity transformations by elementary complex rotations to drive the oo-diagonal entries to zero. We show that its asymptotic convergence rate is quadratic and that it is numerically stable. It preserves the ...

متن کامل

Complex Non-Orthogonal Joint Diagonalization Based on LU and LQ Decompositions

In this paper, we propose a class of complex non-orthogonal joint diagonalization (NOJD) algorithms with successive rotations. The proposed methods consider LU or LQ decompositions of the mixing matrices, and propose to solve the NOJD problem via two successive stages: L-stage and U (or Q)-stage. Moreover, as the manifolds of target matrices in these stages could be appropriately parameterized ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013